Integrating Heuristics for Constraint Satisfaction Problems: A Case Study
نویسنده
چکیده
This paper describes a set of experiments with a system that synthesizes constraint satisfaction programs. The system, Multi-tac, is a CSP \ex-pert" that can specialize a library of generic algorithms and methods for a particular application. Multi-tac not only proposes domain-speciic versions of its generic heuristics, but also searches for the best combination of these heuristics and integrates them into a complete problem-speciic program. We demonstrate Multi-tac's capabilities on a combinatorial problem, \Minimum Maximal Matching", and show that Multi-tac can synthesize programs for this problem that are on par with hand-coded programs. In synthesizing a program , Multi-tac bases its choice of heuristics on the instance distribution, and we show that this capability has a signiicant impact on the results.
منابع مشابه
Integrating Stochastic Solvers with Constraint Logic Programming
This paper proposes a general framework for integrating a constraint logic programming system with a stochastic constraint solver to solve constraint satisfaction problems eeciently. Stochas-tic solvers can solve hard constraint satisfaction problems very eeciently, and constraint logic programming allows heuristics and problem breakdown to be encoded in the same language as the constraints. He...
متن کاملUsing Stochastic Solvers in Constraint Logic Programming
This paper proposes a general framework for integrating a constraint logic programming system with a stochastic constraint solver to solve constraint satisfaction problems eeciently. Stochastic solvers can solve hard constraint satisfaction problems very eeciently, and constraint logic programming allows heuristics and problem breakdown to be encoded in the same language as the constraints. Hen...
متن کاملOptimal Refutations for Constraint Satisfaction Problems
Variable ordering heuristics have long been an important component of constraint satisfaction search algorithms. In this paper we study the behaviour of standard variable ordering heuristics when searching an insoluble (sub)problem. We employ the notion of an optimal refutation of an insoluble (sub)problem and describe an algorithm for obtaining it. We propose a novel approach to empirically lo...
متن کاملThe Complexity of Constraint Satisfaction in Prolog
We obtain here the complexity of solving a type of Prolog problem which Genesereth and Nilsson have called sequential constraint satisfactrlon. Such problems are of direct relevance to relational database retrieval as well as providing a tractable first step in analyzing Prolog problem-solving in the general case. The present paper provides the first analytic expressions for the expected comple...
متن کاملModels for Using Stochastic Constraint Solvers in Constraint Logic Programming
This paper proposes a number of models for integrating stochastic constraint solvers into constraint logic programming systems in order to solve constraint satisfaction problems eeciently. Stochastic solvers can solve hard constraint satisfaction problems very eeciently, and constraint logic programming allows heuristics and problem breakdown to be encoded in the same language as the constraint...
متن کامل